Recovering Consistency by Forgetting Inconsistency

International audienceIn this paper, we introduce and study a new paraconsistent inference relation |=c in the setting of 3-valued paraconsistent logics.Using inconsistency forgetting as a key mechanism for recovering consistency, it guarantees that the deductive closure Cn|=c(Σ) of any belief base Σ is classically consistent and classically closed. This strong feature, not shared by previous inference relations in the same setting, allows to interpret an inconsistent belief base as a set of classical worlds (hence to reason classically from them)

Hypothetical Reasoning for Automatic Recognition of Continuous Speech

International audienc

Interaction between Most Reliable Acoustic Cues and Lexical Analysis

International audienc

Intéraction entre le décodage acoustico-phonétique et l'analyse lexicale grace aux techniques du raisonnement hypothétique : le système DAPHNE

National audienc

Une application de la révision en reconnaissance automatique de la parole

National audienc

From Explanations to Intelligible Explanations

Workshop at KR'20International audienc

Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases

International audienc

On the complexity of paraconsistent indference relations

state-of-the-art subserie